Network Code Design for Orthogonal Two-hop Network with Broadcasting Relay: A Joint Source-Channel-Network Coding Approach

This paper addresses network code design for robust transmission of sources over an orthogonal two-hop wireless network with a broadcasting relay. The network consists of multiple sources and destinations in which each destination, benefiting the relay signal, intends to decode a subset of the sources. Two special instances of this network are orthogonal broadcast relay channel and the orthogonal multiple access relay channel. The focus is on complexity constrained scenarios, e.g., for wireless sensor networks, where channel coding is practically imperfect. Taking a source-channel and network coding approach, we design the network code (mapping) at the relay such that the average reconstruction distortion at the destinations is minimized. To this end, by decomposing the distortion into its components, an efficient design algorithm is proposed. The resulting network code is nonlinear and substantially outperforms the best performing linear network code. A motivating formulation of a family of structured nonlinear network codes is also presented. Numerical results and comparison with linear network coding at the relay and the corresponding distortion-power bound demonstrate the effectiveness of the proposed schemes and a promising research direction.Comment: 27 pages, 9 figures, Submited to IEEE Transaction on Communicatio

Bounds on the Capacity of ASK Molecular Communication Channels with ISI

There are now several works on the use of the additive inverse Gaussian noise (AIGN) model for the random transit time in molecular communication~(MC) channels. The randomness invariably causes inter-symbol interference (ISI) in MC, an issue largely ignored or simplified. In this paper we derive an upper bound and two lower bounds for MC based on amplitude shift keying (ASK) in presence of ISI. The Blahut-Arimoto algorithm~(BAA) is modified to find the input distribution of transmitted symbols to maximize the lower bounds. Our results show that over wide parameter values the bounds are close.Comment: 7 pages, 4 figures, Accepted in IEEE GLOBECOM 201

Resource allocation in OFDMA networks with half-duplex and imperfect full-duplex users

Recent studies indicate the feasibility of in-band fullduplex (FD) wireless communications, where a wireless radio transmits and receives simultaneously in the same band. Due to its potential to increase the capacity, analyzing the performance of a cellular network that contains full-duplex devices is crucial. In this paper, we consider maximizing the weighted sum-rate of downlink and uplink of a single cell OFDMA network which consists of an imperfect FD base-station (BS) and a mixture of half-duplex and imperfect full-duplex mobile users. To this end, the joint problem of sub-channel assignment and power allocation is investigated and a two-step solution is proposed. A heuristic algorithm to allocate each sub-channel to a pair of downlink and uplink users with polynomial complexity is presented. The power allocation problem is convexified based on the difference of two concave functions approach, for which an iterative solution is obtained. Simulation results demonstrate that when all the users and the BS are perfect FD nodes the network throughput could be doubled, Otherwise, the performance improvement is limited by the inter-node interference and the self-interference. We also investigate the effect of the self-interference cancellation capability and the percentage of FD users on the network performance in both indoor and outdoor scenarios.Comment: 6 pages, 8 figures, Accepted in IEEE International Conference on Communication (ICC), Malaysia, 201